Simulated quantum computation of global minima
نویسندگان
چکیده
منابع مشابه
Exact Computation of Global Minima of a Nonconvex Portfolio Optimization Problem
The goal of this project was to compute minimal cost solutions satisfying the demand of pre-given product portfolios and to investigate the dependence of the fix costs and investment costs on the product portfolio. The most important parameters characterizing the production facilities are the number and the size of the reactors. The production is subject to shelf-life constraints, i.e., product...
متن کاملGlobal minima for semilinear optimal control problems
We consider an optimal control problem subject to a semilinear elliptic PDE together with its variational discretization. We provide a condition which allows to decide whether a solution of the necessary first order conditions is a global minimum. This condition can be explicitly evaluated at the discrete level. Furthermore, we prove that if the above condition holds uniformly with respect to t...
متن کاملSimulated Analog Computation
This paper describes an approach to solving differential equations based on a block diagram solver. We call this solver Simulated Analog Computer (SAC) because our computational model took inspiration from the structure of the Analog Computers.. The model of analog computation offers an elegant representation of the solution to systems of differential equations encountered in modeling and simul...
متن کاملGlobal Ozone Minima in the Historical Record
The magnitude and structure of the global total ozone minimum between 1958 and 1962 is similar to that observed between 1979 and 1983. Analysis of the single station data that exhibit the most pronounced minima suggest that the spatial structure of the global minimum is different from the currently observed reduction. Very low north polar values were observed, but there is no indication of anom...
متن کاملVerifying global minima for L2 minimization problems
We consider the least-squares (L2) triangulation problem and structure-and-motion with known rotatation, or known plane. Although optimal algorithms have been given for these algorithms under an L-infinity cost function, finding optimal least-squares (L2) solutions to these problems is difficult, since the cost functions are not convex, and in the worst case can have multiple minima. Iterative ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecular Physics
سال: 2009
ISSN: 0026-8976,1362-3028
DOI: 10.1080/00268970903117126